- Markov's inequality
- неравенство n Маркова
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
Markov's inequality
Смотреть что такое "Markov's inequality" в других словарях:
Markov's inequality — gives an upper bound for the measure of the set (indicated in red) where f(x) exceeds a given level . The bound combines the level with the average value of f … Wikipedia
Markov brothers' inequality — In mathematics, the Markov brothers inequality is an inequality proved by Andrey Markov and Vladimir Markov. This inequality bounds the maximum of the derivatives of a polynomial on an interval in terms of the maximum of the polynomial.[1] For k … Wikipedia
Inequality — In mathematics, an inequality is a statement about the relative size or order of two objects, or about whether they are the same or not (See also: equality) *The notation a < b means that a is less than b . *The notation a > b means that a is… … Wikipedia
Inequality (mathematics) — Not to be confused with Inequation. Less than and Greater than redirect here. For the use of the < and > signs as punctuation, see Bracket. More than redirects here. For the UK insurance brand, see RSA Insurance Group. The feasible regions… … Wikipedia
Markov process — In probability theory and statistics, a Markov process, named after the Russian mathematician Andrey Markov, is a time varying random phenomenon for which a specific property (the Markov property) holds. In a common description, a stochastic… … Wikipedia
Chebyshev's inequality — For the similarly named inequality involving series, see Chebyshev s sum inequality. In probability theory, Chebyshev’s inequality (also spelled as Tchebysheff’s inequality) guarantees that in any data sample or probability distribution, nearly… … Wikipedia
Concentration inequality — In mathematics, concentration inequalities provide probability bounds on how a random variable deviates from some value (e.g. its expectation). The laws of large numbers of classical probability theory state that sums of independent random… … Wikipedia
Andrey Markov — For other people named Andrey Markov, see Andrey Markov (disambiguation). Andrey (Andrei) Andreyevich Markov Born June 14, 1856( … Wikipedia
Kolmogorov's inequality — In probability theory, Kolmogorov s inequality is a so called maximal inequality that gives a bound on the probability that the partial sums of a finite collection of independent random variables exceed some specified bound. The inequality is… … Wikipedia
Hoeffding's inequality — Hoeffding s inequality, named after Wassily Hoeffding, is a result in probability theory that gives an upper bound on the probability for the sum of random variables to deviate from its expected value.Let :X 1, dots, X n ! be independent random… … Wikipedia
Bernstein's inequality (mathematical analysis) — In the mathematical theory of mathematical analysis, Bernstein s inequality, named after Sergei Natanovich Bernstein, is defined as follows.Let P be a polynomial of degree n with derivative P prime; . Then:max(P ) le ncdotmax(P) where we define… … Wikipedia
